A note about shortest cycle coversJINLONG SHU; ZHANG, Cun-Quan.Discrete mathematics. 2005, Vol 301, Num 2-3, pp 232-238, issn 0012-365X, 7 p.Article

SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREEKAISER, Tomáš; KRAL, Daniel; LIDICKY, Bernard et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 1, pp 330-355, issn 0895-4801, 26 p.Article

Reducing truckload transportation costs through collaborationERGUN, Ozlem; KUYZU, Gultekin; SAVELSBERGH, Martin et al.Transportation science. 2007, Vol 41, Num 2, pp 206-221, issn 0041-1655, 16 p.Article

Cycle cover property and CPP = SCC property are not equivalentRIZZI, Romeo.Discrete mathematics. 2002, Vol 259, Num 1-3, pp 337-342, issn 0012-365X, 6 p.Article

Small cycle cover of 2-connected cubic graphsLAI, Hong-Jian; XIANGWEN LI.Discrete mathematics. 2003, Vol 269, Num 1-3, pp 295-302, issn 0012-365X, 8 p.Article

Determinant : Old algorithms, new insightsMAHAJAN, M; VINAY, V.SIAM journal on discrete mathematics (Print). 1999, Vol 12, Num 4, pp 474-490, issn 0895-4801Article

The profitable arc tour problem : Solution with a branch-and-price algorithmFEILLET, Dominique; DEJAX, Pierre; GENDREAU, Michel et al.Transportation science. 2005, Vol 39, Num 4, pp 539-552, issn 0041-1655, 14 p.Article

Algorithms and time complexity of the request-service problemCHUNMEI LIU; BURGE, Legand; BLAKE, Ajoni et al.Journal of combinatorial optimization. 2010, Vol 20, Num 2, pp 180-193, issn 1382-6905, 14 p.Article

Applying a combinatorial determinant to count weighted cycle systems in a directed graphHANUSA, Christopher R. H.Discrete mathematics. 2009, Vol 309, Num 6, pp 1746-1748, issn 0012-365X, 3 p.Article

Collapsible graphs and reductions of line graphsCHEN, Zhi-Hong; LAM, Peter C. B; SHIU, Wai-Chee et al.Discrete mathematics. 2009, Vol 309, Num 10, pp 3173-3184, issn 0012-365X, 12 p.Article

Vertex disjoint routings of cycles over toriBERMOND, Jean-Claude; YU, Min-Li.Networks (New York, NY). 2007, Vol 49, Num 3, pp 217-225, issn 0028-3045, 9 p.Article

M²-CYCLE: An optical layer algorithm for fast link failure detection in all-optical mesh networksBIN WU; YEUNG, Kwan L; BING HU et al.Computer networks (1999). 2011, Vol 55, Num 3, pp 748-758, issn 1389-1286, 11 p.Article

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problemsBLÄSER, Markus; SHANKAR RAM, L; SVIRIDENKO, Maxim et al.Operations research letters. 2009, Vol 37, Num 3, pp 176-180, issn 0167-6377, 5 p.Article

ESTIMATE OF THE BÉZOUT NUMBER FOR LINEAR PIECEWISE ALGEBRAIC CURVES OVER ARBITRARY TRIANGULATIONSWANG, Shaofan; WANG, Renhong; DEHUI KONG et al.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 561-582, issn 0895-4801, 22 p.Article

Minimum-weight cycle covers and their approximabilityMANTHEY, Bodo.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1470-1480, issn 0166-218X, 11 p.Article

z-ApproximationsHASSIN, Refael; KHULLER, Samir.Journal of algorithms (Print). 2001, Vol 41, Num 2, pp 429-442, issn 0196-6774Article